Some Reduction Operations to Pairwise Compatibility Graphs
نویسندگان
چکیده
A graph G = (V,E) with a vertex set V and an edge set E is called a pairwise compatibility graph (PCG, for short) if there are a tree T whose leaf set is V , a non-negative edge weight w in T , and two non-negative reals dmin ≤ dmax such that G has an edge uv ∈ E if and only if the distance between u and v in the weighted tree (T,w) is in the interval [dmin, dmax]. PCG is a new graph class motivated from bioinformatics. In this paper, we give some necessary and sufficient conditions for PCG based on cut-vertices and twins, which provide reductions among PCGs. Our results imply that complete k-partite graph, cactus, and some other graph classes are subsets of PCG.
منابع مشابه
On Pairwise Compatibility of Some Graph (Super)Classes
A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edgeweighted tree T and two non-negative real numbers dmin and dmax such that each leaf u of T is a node of V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax where dT (u, v) is the sum of weights of the edges on the unique path from u to v in T . The main issue on these graphs consists in charac...
متن کاملOn the Pairwise Compatibility Property of some Superclasses of Threshold Graphs
A graph G is called a pairwise compatibility graph (PCG) if there exists a positive edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a node u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax, where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we ...
متن کاملA Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
In this paper we give a necessary condition and a sufficient condition for a graph to be a pairwise compatibility graph (PCG). Let G be a graph and let Gc be the complement of G. We show that if Gc has two disjoint chordless cycles then G is not a PCG. On the other hand, if Gc has no cycle then G is a PCG. Our conditions are the first necessary condition and the first sufficient condition for p...
متن کاملNot All Graphs are Pairwise Compatibility Graphs
Given an edge weighted tree T and two non-negative real numbers dmin and dmax, a pairwise compatibility graph of T for dmin and dmax is a graph G = (V, E), where each vertex u ∈ V corresponds to a leaf u of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax in T . Here, dT (u, v) denotes the distance between u and v in T , which is the sum of the weights of the edges on th...
متن کاملDiscovering Pairwise Compatibility Graphs
Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T , and let dmin and dmax be two nonnegative real numbers such that dmin ≤ dmax. Then a pairwise compatibility graph of T for dmin and dmax is a graph G = (V,E), where each vertex u′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and only if dmin ≤ dT (u, v) ≤ d...
متن کامل